Fill-ins number reducing direct solver designed for FIT-type matrix
نویسندگان
چکیده
This paper investigates the particular problem of matrices appearing during the modeling of Integrated Circuits with Finite Integration Technique (FIT) method. We present the key points of FIT approach followed by an illustration of the structure and the properties of the FIT-type matrix. A novel algorithm SMark is proposed, which focuses on fill-ins number reduction. The main idea of SMark is the concept of a dual architecture—symbolic and numeric factorization. In order to validate SMark a comparison with other methods was performed. The excellent results confirm that the proposed approach is an adequate solving method for FIT-type matrices, whereas the identified weak points of the algorithm indicate possible directions in the future work. © 2009 IMACS. Published by Elsevier B.V. All rights reserved.
منابع مشابه
Fast hierarchical solvers for sparse matrices
Sparse linear systems are ubiquitous in various scientific computing applications. Inversion of sparse matrices with standard direct solve schemes are prohibitive for large systems due to their quadratic/cubic complexity. Iterative solvers, on the other hand, demonstrate better scalability. However, they suffer from poor convergence rates when used without a preconditioner. There are many preco...
متن کاملEffective Preconditioning through Ordering Interleaved with Incomplete Factorization
Consider the solution of a sparse linear system Ax = b when the matrix A is symmetric and positive definite. A typical iterative solver is obtained by using the method of Conjugate Gradients (CG) [15] preconditioned with an incomplete Cholesky (IC) factor L̂ [4]. The latter is an approximation to the (complete) Cholesky factor L, where A = LL . Consequently, the process of computing L̂ relies to ...
متن کاملFast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability, but need to be used with an appropriate preconditioner (e.g., ILU, AMG, Gauss-Seidel, etc.) for proper convergence. The choice of an effective preconditioner is highly problem dependent. We propose a novel fully algebraic...
متن کاملThe inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems
Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix N becomes very large. Examples of preconditioners include ILU preconditioners that sparsify the matrix based on some threshold, algebraic multigrid, and specialized preconditioners, e.g., Calderón a...
متن کاملParallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 80 شماره
صفحات -
تاریخ انتشار 2010